Attributed Hierarchical Port Graphs and Applications

نویسندگان

  • Nneka Chinelo Ene
  • Maribel Fernández
  • Bruno Pinaud
چکیده

We present attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems. AHP consist of a number of interconnected layers, where each layer defines a port graph whose nodes may link to layers further down the hierarchy; attributes are used to store user-defined data as well as visualisation and run-time system parameters. We also generalise the notion of strategic port graph rewriting (a particular kind of graph transformation system, where port graph rewriting rules are controlled by user-defined strategies) to deal with AHP following the Single Push-out approach. We outline examples of application in two areas: functional programming and financial modelling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Applications of Graph Operations

In this paper, some applications of our earlier results in working with chemical graphs are presented.

متن کامل

Fast Matching of Hierarchical Attributed Relational Graphs for an Application to Similarity-Based Image Retrieval

This paper describes the fast matching of hierarchical attributed relational graphs with the aim of applying the method to similarity-based image retrieval. Best-first search algorithm, admissible heuristic function, and maximum permissible cost are proposed to speed up the computation of graph matching. By means of these methods, the average computation time of graph matching speeds up about t...

متن کامل

A class of hierarchical graphs as topologies for interconnection networks

We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k, n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In particular, we study: the construction of shortest paths between arbitrary vertices in HCC(k, n); the connectivity of HCC(k, n); and one-to-all b...

متن کامل

A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

In this paper, we propose a distributed broadcasting algorithm with optimal time complexity and without message redundancy for one-toall broadcasting in the one-port communication model on arrangement graph interconnection networks. The algorithm exploits the hierarchical property of the arrangement graph to construct different-sized broadcasting trees for different-sized subgraphs. These diffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.06492  شماره 

صفحات  -

تاریخ انتشار 2018